Intuitionistic fuzzy recursive enumerable languages and its closure properties
نویسندگان
چکیده
منابع مشابه
Intuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages
In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...
متن کاملIntuitionistic Fuzzy θ-Closure Operator
The concepts of fuzzy θ-open (θ-closed)sets and fuzzy θ-closure operator are introduced and discussed in intuitionistic fuzzy topological spaces. As applications of these concepts, certain functions are characterized in terms of intuitionistic fuzzy θ-closure operator.
متن کاملRecursive and Recursively Enumerable
I. Basic concepts 1. Recursive enumerability and recursiveness. We consider infinite sequences of non-negative integers, free from repetitions. A familiar equivalence relation between such sequences is that based on sets: two sequences are equivalent when they enumerate the same set. The equivalence classes under this relation, with the necessary operations introduced, form a system isomorphic ...
متن کاملm-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملOn Intuitionistic Fuzzy Context-Free Languages
Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem. By introducing the generalized subset c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0s01/0063